Regular Flip Equivalence of Surface Triangulations

نویسنده

  • SIMON A. KING
چکیده

Any two triangulations of a closed surface with the same number of vertices can be transformed into each other by a sequence of flips, provided the number of vertices exceeds a number N depending on the surface. Examples show that in general N is bigger than the minimal number of vertices of a triangulation. The existence of N was known, but no estimate. This paper provides an estimate for N that is linear in the Euler characteristic of the surface. 1. Results on flip equivalence Let F be a closed surface and let χ(F ) be its Euler characteristic. A singular triangulation of F is a graph T embedded in F such that each face of F \ T is bounded by an edge path of length three. We denote by v(T ), e(T ) and f(T ) the number of vertices, edges and faces of T . If T is without loops and multiple edges and has more than three faces, then T corresponds to a triangulation of F in the classical meaning of the word; in order to avoid confusions, we use for it the term regular triangulation. Let e be an edge of a singular triangulation T and suppose that there are two distinct faces δ1 and δ2 adjacent to e. The faces δ1 and δ2 form a (possibly degenerate) quadrilateral, containing e as a diagonal. A flip of T along e replaces e by the opposite diagonal of this quadrilateral, see Figure 1. The flip is called regular, if both T and the result of the flip are regular triangulations. Two singular (resp. regular) triangulations T1, T2 of a closed surface are called flip equivalent (resp. regularly flip equivalent), if they are related by a finite sequence of flips (resp. regular flips) and isotopy. The following result is well known, and there are many proofs for it. There are interesting applications to the automatic structure of mapping class groups, see [4] or [8]. Lemma 1. Any two singular triangulations T1 and T2 of a closed surface F with v(T1) = v(T2) are flip equivalent. One might ask whether any two regular triangulations of F with the same number of vertices are regularly flip equivalent. The answer is “Yes” in special cases: any two regular triangulations of the sphere [9], the torus [2], the projective plane or the Klein bottle [6] with the same number of vertices are regularly flip equivalent. But in general, the answer is “No”: it is known that there are 59 different triangulations of the closed oriented surface of genus six based on the complete graph with 12 vertices, see [1]. Such a triangulation does not admit any regular flip, thus the different triangulations are not regularly flip equivalent. This paper is devoted to the proof of the following theorem. A preliminary version of this paper has been appeared in [3]. Theorem 1. Let F be a closed surface and N(F ) = 9450 − 6020χ(F ). Any two regular triangulations T1 and T2 of F with v(T1) = v(T2) ≥ N(F ) are regularly flip equivalent.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Constrained paths in the flip-graph of regular triangulations

We describe particular paths in the flip-graph of regular triangulations in any dimension. It is shown that any pair of regular triangulations is connected by a path along which none of their common faces are destroyed. As a consequence, we obtain the connectivity of the flip-graph of regular triangulations that share the same vertex set. © 2006 Elsevier B.V. All rights reserved.

متن کامل

ar X iv : m at h / 99 03 13 6 v 1 [ m at h . G T ] 2 3 M ar 1 99 9 An improvement of a result of Negami

Seiya Negami showed that any two triangulations of a closed surface with the same number of vertices can be transformed into each other by a sequence of regular flips, provided the number of vertices exceeds a number N depending on the surface. Negami's proof is inconstructive, he didn't give an estimate for N. It is shown in this paper that N is linearly bounded by the Euler characteristic of ...

متن کامل

Parallel Enumeration of Triangulations

We report on the implementation of an algorithm for computing the set of all regular triangulations of finitely many points in Euclidean space. This algorithm, which we call down-flip reverse search, can be restricted, e.g., to computing full triangulations only; this case is particularly relevant for tropical geometry. Most importantly, down-flip reverse search allows for massive parallelizati...

متن کامل

Layered - Triangulations of 3 – Manifolds

A family of one-vertex triangulations of the genus-g-handlebody, called layered-triangulations, is defined. These triangulations induce a one-vertex triangulation on the boundary of the handlebody, a genus g surface. Conversely, any one-vertex triangulation of a genus g surface can be placed on the boundary of the genus-g-handlebody in infinitely many distinct ways; it is shown that any of thes...

متن کامل

Delaunay Edge Flips in Dense Surface Triangulations

Delaunay flip is an elegant, simple tool to convert a triangulation of a point set to its Delaunay triangulation. The technique has been researched extensively for full dimensional triangulations of point sets. However, an important case of triangulations which are not full dimensional is surface triangulations in three dimensions. In this paper we address the question of converting a surface t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002